Simulation Based Estimation of Discrete Sequential Move Games of Perfect Information
نویسندگان
چکیده
We propose simulation based estimation for discrete sequential move games of perfect information which relies on the simulated moments and importance sampling. We use importance sampling techniques not only to reduce computational burden and simulation error, but also to overcome non-smoothness problems. The model is identified with only weak scale and location normalizations, monte Carlo evidence demonstrates that the estimator can perform well in moderately-sized samples.
منابع مشابه
Generalized Maximum Entropy estimation of discrete sequential move games of perfect information
We propose a data-constrained generalized maximum entropy estimator for discrete sequential move games of perfect information. Unlike most other work on the estimation of complete information games, the method we proposed is data constrained and requires no simulation or assumptions about the distribution of random preference shocks. We formulate the GME estimation as a (convex) mixed-integer n...
متن کاملEstimating Sequential-move Games by a Recursive Conditioning Simulator
Sequential decision-making is a noticeable feature of strategic interactions among agents. The full estimation of sequential games, however, has been challenging due to the sheer computational burden, especially when the game is large and asymmetric. In this paper, I propose an estimation method for discrete choice sequential games that is computationally feasible, easy-to-implement, and e¢ cie...
متن کاملEstimation of Finite Sequential Games
I propose a new estimation method for nite sequential games that is e¢ cient, computationally attractive, and applicable to a fairly general class of nite sequential games that is beyond the scope of existing studies. The major challenge is computation of high-dimensional truncated integration whose domain is complicated by strategic interaction. This complication resolves when unobserved o¤-...
متن کاملA simple and numerically stable primal-dual algorithm for computing Nash-equilibria in sequential games with incomplete information
We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...
متن کاملConcurrent control on resource planning and revenue/expenditure estimation in large-scale shell material embankment projects management using discrete-event simulation
Resource planning in large-scale construction projects has been a complicated management issue requiring mechanisms to facilitate decision making for managers. In the present study, a computer-aided simulation model is developed based on concurrent control of resources and revenue/expenditure. The proposed method responds to the demand of resource management and scheduling in shell material emb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013